- total correctness
- Программирование: полная правильность
Универсальный англо-русский словарь. Академик.ру. 2011.
total correctness
Смотреть что такое "total correctness" в других словарях:
Correctness (computer science) — In theoretical computer science, correctness of an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. Functional correctness refers to the input output behaviour of the algorithm (i.e., for each… … Wikipedia
Loop variant — In computer science, a loop variant is a mathematical function defined on the state space of a computer program having the property that each iteration of a loop (given its invariant) strictly decreases its value with respect to a well founded… … Wikipedia
Hoare logic — (also known as Floyd ndash;Hoare logic) is a formal system developed by the British computer scientist C. A. R. Hoare, and subsequently refined by Hoare and other researchers. The purpose of the system is to provide a set of logical rules in… … Wikipedia
Real-time computing — In computer science, real time computing (RTC) is the study of hardware and software systems that are subject to a real time constraint i.e., operational deadlines from event to system response. By contrast, a non real time system is one for… … Wikipedia
Termination analysis — In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely terminate. Because the halting problem is undecidable, termination analysis cannot work… … Wikipedia
доказательство общей правильности — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN total correctness, proof of … Справочник технического переводчика
Operational transformation — Operation Transformation redirects here. For the cross media event, see Operation Transformation (TV series). Operational transformation (OT) is a technology for supporting a range of collaboration functionalities in advanced groupware systems.… … Wikipedia
Religion (Philosophies of) — Philosophies of religion Marcel, Jaspers, Levinas William Desmond Gabriel Marcel (1889–1973), Karl Jaspers (1883–1969) and Emmanuel Levinas (1906–) seem like a mere aggregate of thinkers. Jaspers, a German thinker who coined the phrase Existenz… … History of philosophy
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Serializability — In concurrency control of databases,[1][2] transaction processing (transaction management), and various transactional applications (e.g., transactional memory[3] and software transactional memory), both centralized and distributed, a transaction… … Wikipedia
Gödel numbering for sequences — A Gödel numbering for sequences provides us an effective way to represent each finite sequence of natural numbers as a single natural number. Of course, the embedding is surely possible set theoretically, but the emphasis is on the effectiveness… … Wikipedia
